Cooperative Caching for Timely and Secure Data Access in Disruption Tolerant Networks

Disruption Tolerant Networks (DTNs) consist of mobile devices that contact each other opportunistically. Propose the original approach to support cooperative caching in DTNs, which enable the sharing and coordination of cached data among multiple nodes and reduces data access delay. The fundamental idea is to intentionally cache data at a set of network central locations (NCLs), which can be easily access by other nodes in the network. Propose an efficient method that ensures appropriate NCL selection based on a probabilistic selection metric and coordinates multiple caching nodes to optimize the tradeoff between data accessibility and caching overhead. The selected NCLs attain high chances for prompt response to user queries with low overhead in network storage and communication. A utility based cache replacement scheme to dynamically adjust cache locations based on query history, A Contact Duration Aware Approach a novel caching protocol adaptive to the challenging surroundings of DTNs. To derive an adaptive caching bound for each mobile node according to its specific contact pattern with others, to limit the quantity of information it caches. Extensive trace driven simulations show that our cooperative caching protocol can significantly improve the performance of data access in DTNs.